Method and system for displaying categorized information on a user interface

ABSTRACT

A computer implemented method and system for displaying categorized information on a user interface is provided, in which the user may choose one or more categories of information. In response, data associated with the chosen category is retrieved. The display of the categories and the retrieval of the data is performed independently, so that the displayed categories remain responsive to user interaction while the data is being retrieved. In one implementation, the display of the categories and information on the user interface is handled by the main thread and the retrieval of the data associated with the chosen category is performed by a worker thread executing asynchronously with respect to the main thread.

TECHNICAL FIELD OF THE INVENTION

The invention relates generally to the display of categorizedinformation on a user interface and, more particularly, to the displayof categories on a user interface in a way that is independent from thedisplay of data associated with the categories.

BACKGROUND OF THE INVENTION

There are many ways in which data can be presented to a user on a userinterface. One of the more popular ways is organize the data intocategories and present the categories on one part of the screen. Theuser may then select a category and in response, the user interfacedisplays data relating to the selected category on another part of thescreen. Referring to FIG. 1, for example, a user interface 10 is shown.The user interface 10 includes a left pane 4 and a right pane 6. A diskdirectory is presented as a set of folder icons 2 in the left pane 4.Each folder icon 2 represents a sub-directory. When the user selects afolder icon, the folder icon is highlighted and files within thesub-directory represented by the selected folder icon are displayed inthe right pane 6. In one popular type of categorized presentation, thecategories are organized into a graphical hierarchy, such as a tree.Referring to FIG. 2, for example, the folder icons 2 from FIG. 1 aredisplayed as nodes or “branches” of a tree 12.

Manipulating categorized user interfaces can be frustrating for theuser, however, this is especially true when the categories themselves orthe data associated with the categories take a long time to retrieve.For example, if the user selects the “documents” folder (FIG. 2) thecomputer has to retrieve the names of the files located in thesub-directory “documents” so that they can be displayed in the pane 6.However, if one or more of the files is located on a remote computer towhich the network link has been lost, the user interface will be frozen,and the user will receive a “wait” cursor 8 (FIG. 3) while his computerattempts in vain to find the files in the “documents” sub-directory.

Thus, it can be seen that there is a need for a method and system fordisplaying categorized information on a user interface that overcomesthese limitations.

SUMMARY OF THE INVENTION

In accordance with this need, a computer implemented method and systemfor displaying categorized information on a user interface is provided,in which the user may choose one or more categories of information. Inresponse, data associated with the chosen category is retrieved. Thedisplay of the categories and the retrieval of the data is performedindependently, so that the displayed categories remain responsive touser interaction while the data is being retrieved. In oneimplementation, the display of the categories and information on theuser interface is handled by the main thread and the retrieval of thedata associated with the chosen category is performed by a worker threadexecuting asynchronously with respect to the main thread.

Additional features and advantages of the invention will be madeapparent from the following detailed description of illustrativeembodiments that proceeds with reference to the accompanying figures.

BRIEF DESCRIPTION OF THE DRAWINGS

While the appended claims set forth the features of the presentinvention with particularity, the invention, together with its objectsand advantages, may be best understood from the following detaileddescription taken in conjunction with the accompanying drawings ofwhich:

FIGS. 1-3 are examples of categorized user interfaces;

FIG. 4 is an example of a computer network;

FIG. 5 is an example of a computer;

FIGS. 6-8 show possible features of a user interface that may bedisplayed according to an embodiment of the invention;

FIG. 9 is an example of an architecture that may be used in anembodiment of the invention; and,

FIGS. 10-12 are flow diagrams showing how a main thread, a controlthread and a worker thread function in an embodiment of the invention.

DETAILED DESCRIPTION OF THE INVENTION

The invention is generally directed to a method and system fordisplaying categorized information on a user interface in which data isorganized into selectable categories that are displayed on a screen. Auser may then select a category and, in response, data belonging to thatcategory is retrieved in such a way that it does not interfere with theability of the user to continue to select and/or manipulate thecategories. In an embodiment of the invention, the task of displayingthe categories, the task of retrieving subcategories, and the task ofretrieving the data corresponding to the category selected by the userare handled by separate, independent threads, including: a main threadfor interacting with the user with respect to the categories, and atleast one other thread for retrieving the data associated with theselected category.

Although it is not required, the invention may be implemented bycomputer-executable instructions, such as program modules, that areexecuted by a computer. Generally, program modules include routines,programs, objects, components, data structures and the like that performparticular tasks or implement particular abstract data types. On manycomputers, modules execute within an address space of the computer'smemory, which is typically defined as a “process.” The point ofexecution of the program instructions is often referred to as a“thread.” As is conventional, multiple threads of execution may existfor a single program in a process. Multiple processes may be executed ona single machine, with each process having one or more threads ofexecution. Thus, when multiple threads are discussed herein, it may meanmultiple threads in a single process or multiple threads in differentprocesses.

The invention may be implemented on a variety of types of computers,including personal computers (PCs), hand-held devices, multi-processorsystems, microprocessor-based on programmable consumer electronics,network PCs, minicomputers, mainframe computers and the like. Theinvention may also be employed in distributed computing environments,where tasks are performed by remote processing devices that are linkedthrough a communications network. In a distributed computingenvironment, modules may be located in both local and remote memorystorage devices.

An example of a networked environment in which this system may be usedwill now be described with reference to FIG. 4. The example network 102includes several computers 100 communicating with one another. Thenetwork 102 may include many well-known components, such as routers,gateways, hubs, etc. and may allow the computers 100 to communicate viawired and/or wireless media.

Referring to FIG. 5, an example of a computer on which the inventiondescribed herein may be implemented is shown. In its most basicconfiguration, the computer, generally labeled 100, typically includesat least one processing unit 112 and memory 114. Depending on the exactconfiguration and type of the computer, the memory 114 may be volatile(such as RAM), non-volatile (such as ROM or flash memory) or somecombination of the two. This most basic configuration is illustrated inFIG. 2 by dashed line 106. The computer 100 may also have additionalfeatures/functionality. For example, computer 100 may include additionalstorage (removable and/or non-removable) including, but not limited to,magnetic or optical disks or tape. Computer storage media includesvolatile and non-volatile, removable and non-removable media implementedin any method or technology for storage of information such as computerreadable instructions, data structures, program modules, or other data.Computer storage media includes, but is not limited to, RAM, ROM,EEPROM, flash memory or other memory technology, CD-ROM, digitalversatile disk (DVD) or other optical storage, magnetic cassettes,magnetic tape, magnetic disk storage or other magnetic storage devices,or any other medium which can be used to store the desired informationand which can be accessed by the computer 100. Any such computer storagemedia may be part of computer 100.

Computer 100 may also contain communications connections that allow itto communicate with other devices. A communication connection is anexample of a communication medium. Communication media typicallyembodies computer readable instructions, data structures, programmodules or other data in a modulated data signal such as a carrier waveor other transport mechanism and includes any information deliverymedia. By way of example, and not of limitation, communication mediaincludes wired media such as a wired network or direct-wired connection,and wireless media such as acoustic, RF, infrared and other wirelessmedia. The term computer-readable media as used herein includes bothstorage media and communication media.

Computer 100 may also have input devices such as a keyboard, mouse, pen,voice input device, touch input device, etc. Output devices such as adisplay 118, speakers, a printer, etc. may also be included. All thesedevices are well known in the art and need not be discussed at lengthhere.

A user interface that operates in accordance with the teachings of theinvention may be implemented in a variety of ways. In one embodiment,the interface has one area for displaying the categories into which theinformation is organized, and another area for displaying dataassociated one or more of the categories as specified by the user.Referring to FIG. 6, for example, a user interface 50 displays diskdirectory information that is categorized according to the part of thenetwork in which it is located and according to the computer on which itis located. The categories include network, sub-network (“subnet”) andcomputer (“machine”). The user interface 50 includes a left pane 52 anda right pane 54. A tree 68 is displayed in the left pane 52. The tree 68includes nodes 56, 58, 60, 62, 64, and 66 that can be expanded orcollapsed by the user. Each node represents a category. For example, thenode 60 represents the category “Disk directories of computers in SubnetB” (“Subnet B” for short) while the node 66 represents the category“Disk directory of Machine 3” (“Machine 3” for short). The right pane 54contains data associated with the category selected in the left pane 52.In this example, the user has selected the node 66 for the category“Disk directory Machine 3.” The disk directory for Machine 3, generallylabeled 74, is displayed in the pane 54.

When the program that displays the user interface 50 is executed, itdoes not have any initial knowledge as to what categories are supposedto be listed in the right pane 52. The program obtains this informationin a process referred to herein as “populating” the categories or, inthe example user interface 50 (FIG. 6), populating the tree 68 withnodes. This process may be fast, or, if there is some problem inretrieving the node data—e.g. the names of the categories are stored ona remote server that has crashed—this process may be very slow. Inconventional user interfaces, the user interface simply freezes untilthe tree can be populated. According to an embodiment of the invention,a program retrieves the categories independently from displaying them.This technique helps ensure that the user interface does not freeze upwith the categories are being retrieved or “populated.” While thecategories are being retrieved, the program gives status information tothe user concerning the retrieval operation. Referring to FIG. 7, forexample, the program displays an incomplete tree 70 on the userinterface 50 while the category information is being retrieved. The tree70 has a placeholder 72 as one of its nodes. The placeholder 72 tellsthe user the status of the remaining tree nodes. In this case, theremaining tree nodes are being retrieved, as signified by the“retrieving” label. According to an embodiment of the invention, if theprogram is implemented with independent threads of execution, theretrieving thread may retrieve data for all child nodes if it can bedone with a single request to the data storage. Otherwise, theretrieving thread only retrieves direct descendents of the node beingpopulated. This helps eliminate the unnecessary processing of data thatis not needed immediately.

As previously discussed, many user interfaces allow the user to choose acategory that describes the type of information the user would like toview. In response, the user interface displays data associated with thatcategory. However, the data may have to be retrieved from a remotestorage device, such as a computer located on the far side of a network,thus creating a delay in displaying the data on the user interface.Furthermore, the network link to the storage device may be lost, makingit impossible to retrieve the data. In an embodiment of the invention, aprogram performs the function of displaying the categories independentlyfrom the function of retrieving the data for a selected category. Thishelps insure that the user interface does not freeze up while the datais being retrieved. While the data is being retrieved, the program givesstatus information to the user concerning the retrieval operation.Referring to FIG. 8, for example, the program displays a status messagein the right pane 54 of the user interface 50. The message indicates thestatus of the data retrieval operation. In this case, the message is“retrieving” to indicate that data for the category “Machine 3” is beingretrieved.

Referring to FIG. 6, an optional feature of the invention will now bedescribed. According to the optional feature, the user may selectmultiple categories at a time. The program controlling the userinterface 50 may, in response, independently retrieve data for eachselected category. For example, the user might “click” on Machine 1(node 62). The program controlling the user interface 50 would respondby retrieving the disk directory data for Machine 1. While the data forMachine 1 was being retrieved, the user may click on Machine 3 (node66). The program could respond by retrieving the data for Machine 3independently of retrieving the data for Machine 1 and independently ofdisplaying the tree 68. The program could then display the data for oneof the selected categories in the pane 54 while caching the data for theother selected category or categories. In the previous example, sincethe user selected Machine 1 and then selected Machine 3, the programmight assume that the user was most interested in seeing the data forMachine 3. The program could then cache the data associated with Machine1 when it arrived and display the data for Machine 3 when it arrived.

According to another optional feature, a user may cause the program tocancel a retrieval operation. Referring again to FIG. 6, a user may, forexample, select Machine 3 (node 66) as the desired category of diskdirectory data. During retrieval of the disk directory data for Machine3, the user may then change his mind and cancel the retrieval by, forexample, right clicking on node 66 and selecting “cancel” on a-pop-upmenu. The program controlling the user interface 50 would respond byhalting the data retrieval operation.

According to yet another optional feature, a user may cause the programto change the priority of a data retrieval, either explicitly, such asby using a pop-up menu or implicitly, such as by selecting newcategories on the user interface. For example, if the user selectsMachine 1, then selects Machine 2, and then select Machine 3, theprogram will have 3 independent data retrievals in progress. Since thelast category selected was Machine 3, the program assumes that retrievalof the directory from Machine 3 is the most urgent and therefore givesit the highest priority. Thus the program preempts the retrieval of theMachine 1 and Machine 2 directory data. The program may also beconfigured to treat the selection of a category as an implicit requestto boost priority. For example, the user may be permitted to boost thepriority of the Machine 1 data retrieval by simply re-selecting Machine1 (node 62). Other implicit priority boost schemes are possible. In anexample of an explicit priority boost, the user may right click Machine1 (node 62) and select “Boost priority” from a pop-up menu.

According to still another possible feature, the user may viewincomplete or partial directory data in the right pane 54. For example,if the user has chosen Machine 3 (node 66 of FIG. 9) in the left pane52, and the directory data associated with the computer “Machine 3” istaking some time to be retrieved, the user could move the cursor to theright pane 54, right-click, and choose “view partial results” from apop-up menu.

According to yet another possible feature, nodes and data correspondingto nodes may be retrieved automatically, without any selection orrequest by the user, if it can be reasonably assumed that the user wouldwant the nodes or data to be retrieved. For example, if a node has onechild, then the nodes below it on the tree can be retrieved andpopulated automatically in advance.

According to still another possible feature, frequently chosencategories can be identified and requests for the retrieval of datacorresponding to such categories can be automatically issued. This maybe advantageous in cases where a node has multiple children. Forexample, if in FIG. 8, Machine 1 (node 62) was the most or one of themost often selected nodes, a request for the retrieval of directory datafor Machine 1 may automatically be issued as soon as the Subnet B (node58) was populated with the Machine 1 node. Thus, when the user doesselect the Machine 1 node, the directory data for Machine 1 may alreadybe in cache, or may be on its way to cache. The most often selected nodeor nodes may be maintained on a list in memory.

Referring to FIG. 9, the architecture and functionality of an embodimentof the invention will now be described. This embodiment executes as oneor more program modules on a computer 198. The computer 198 includes acache memory 202 and communicates with data storage units 212. Thecomputer 198 executes a main thread 204, a control thread 208, and apool 210 of worker threads. The main thread 204 creates and maintainsuser interface 50 (from FIGS. 6-8) through which the user can interact.When the main thread 204 initializes, it creates the control thread 208.The control thread 208 then creates the worker thread in the thread pool210. The control thread sends one of the worker threads to obtain thecategory data for the tree 68. The worker thread retrieves the categorydata from one of the data storage units 212 and store the data directlyto the tree data structure.

When the user selects a category from the left pane 52—such as byclicking a branch on the tree 68 labeled with that category—the mainthread 204 first checks the cache 202 to see if the data is there. Ifnot, it creates a request for the data associated with that category andplaces the request in a queue 200. The control thread 208 monitors thequeue 200 and, if it detects an unprocessed request, it activates aworker thread from the thread pool 210. The worker thread then retrievesthe data and places it in the cache 202. The worker thread notifies mainthread 204. The main thread 204 displays the retrieved data in the rightpane 54.

Referring to flow diagram of FIG. 10, the operation of the main thread204 (FIG. 9) according to a more specific embodiment of the inventionwill now be described. After creating the control thread 208 the mainthread 204 enters the state shown as block 220, in which it displays thetree 68 to the user, and populates it with those categories that areavailable. For those categories not yet available, the main threaddisplays a placeholder, such as the placeholder 72 shown in FIG. 7. Asthe category data is put into the tree data structure, the main thread204 updates the tree 68 on the user interface 50.

When the user selects a computer such as by clicking on a node of thetree 68, the state of the main thread moves to block 240 of FIG. 10. Atblock 240, the main thread checks the cache 202 (FIG. 9) to see if thedisk directory data for the selected computer is there. If the data isthere, the main thread moves to block 242, at which it retrieves thedata from the cache and displays it in the right panel 54 (FIG. 6). Whencomplete, the main thread returns to block 220. If the data is not incache, then the main thread moves to block 238, in which it checks thequeue 200 (FIG. 9) to determine if a request for the data has alreadybeen entered. If a request for the disk directory data associated thisthe selected machine is already in the queue, the main thread returns toblock 220. If it is not already in the queue, then the main thread movesto block 236, at which it places a request for the disk directory datain the queue.

As previously described, a user may raise the priority of an in-progressretrieval of disk directory data by activating a pop-up menu, or byre-selecting a previously selected category. The main thread reacts bymoving to block 230 (FIG. 10), at which it looks in the queue 200 (FIG.9) to see if the request that is to be boosted is still there. If it is,then the main thread moves to block 228, at which the it moves therequest to the front of the queue. If the request is not in thequeue—such as when the request is already being serviced by a workerthread—then the main thread puts a request to have the priority of thedata retrieval boosted. For example, if the user indicated that hewanted the priority of the retrieval operation for Machine 1 directorydata (FIG. 6), then the main thread would look in the queue to see ifthe request for Machine 1 data was still pending. If it was then themain thread would move the request to the front of the queue. If not,then the main thread would put a new request at the front of the queue.The purpose of the new request would tell the control thread 208 to findthe worker thread that is currently retrieving the Machine 1 directorydata and boost its priority. The main thread would then return to block220.

If the user indicates a desire to cancel a data retrieval, then the mainthread reacts by moving to block 222 (FIG. 10) and looking in the queue200 (FIG. 9) to locate the request data retrieval request. If therequest is there, the main thread deletes it at block 224. If therequest is not there—such as when it is already being serviced by aworker thread—the main thread puts a cancel request in the front of thequeue 200 at block 226.

If the user indicates a desire to view the results retrieved so far withrespect to one of the categories, the main thread responds by readingthe data associated with the category, to the extent that it exists,from the cache 202 (FIG. 9) at block 242 of FIG. 10. The main threadthen display the partially retrieved data in the right pane 54 of thedisplay 50 (FIG. 6). For example, if the user selects Machine 3 and getsimpatient, he could right click and select “View partial results.” Themain thread would then locate whatever disk directory data there was inthe cache 202 and display it in the right pane 54.

If the user indicates a desire to refresh the view of the data shown inthe right pane 54, the main thread 204 (FIG. 9) places a refresh requestat the front of the queue 200, as shown in block 234 of FIG. 11. It thenreturns to the suspended state at block 220.

Referring to FIG. 11, the operation of the control thread 208 (FIG. 9)according to a more specific embodiment of the invention will now bedescribed. After initialization, the control thread suspends itself atblock 244 until one or more requests arrives in the queue 200. Thecontrol thread then gets a request from the front of the queue at block246. If the request is a boost request, the control thread proceeds toblock 256, at which it determines which worker thread of the thread pool210 (FIG. 9) is handling the request to be boosted. It then lowers forpriority of the other active worker threads, such as by making theappropriate calls to the thread scheduler of the computer's operatingsystem. If the request taken from the queue at block 246 is a cancelrequest, is the control thread proceeds to block 258, at which itlocates the worker thread handling the request to be cancelled andcancels it. The control thread then returns to the suspended state atblock 244.

If the request obtained from the queue 200 a request for the retrievalof data associated with a selected category, or is a request to have theview refreshed, then the control thread 208 proceeds to block 248 ofFIG. 11. At block 248, the control thread determines if there is aworker thread in the thread pool 210 that is available to service therequest. If there is not, the control thread proceeds to block 249, atwhich it moves the request back one position in the queue to defer it.The control thread flow then goes back to block 246. If there is aworker thread available at block 248, and the request is a request fordata retrieval, then the flow proceeds to block 252. At block 252, thecontrol thread determines whether a worker thread is already handlingthe data retrieval request. If no worker thread has been tasked tohandle the request, the control thread resumes an available workerthread to retrieve the disk directory data at block 254. If therealready is a worker thread handling the request, the flow returns toblock 244, at which the control thread is suspended.

Referring again to block 248 of FIG. 11, if the request is a refreshrequest, then the control thread marks the cache dirty at block 250. Thecontrol thread then proceeds to block 252 and, if necessary block 254just as if it had received the request for retrieval of data associatedwith a requested category for the first time.

Referring to FIG. 12, the operation of a worker thread from the threadpool 210 (FIG. 9) will now be described. A worker thread stays in asuspended state at block 260 until it sent off by the control thread 208to retrieve disk directory data. Once the worker thread is sent off, itgoes to blocks 262, 264 and 266 to obtain the data, put it into cache,and notify the main thread that the data is ready. If it gets cancelledwhile retrieving data at block 262, it returns to the suspended state atblock 260.

It can thus be seen that a new a useful method and system for displayingcategorized information on a user interface has been provided. In viewof the many possible embodiments to which the principles of thisinvention may be applied, it should be recognized that the embodimentsdescribed herein with respect to the drawing figures is meant to beillustrative only and should not be taken as limiting the scope ofinvention. For example, those of skill in the art will recognize thatthe elements of the illustrated embodiments shown in software may beimplemented in hardware and vice versa or that the illustratedembodiments can be modified in arrangement and detail without departingfrom the spirit of the invention. Therefore, the invention as describedherein contemplates all such embodiments as may come within the scope ofthe following claims and equivalents thereof.

1-26. (canceled)
 27. A method for presenting hierarchical categorizeddirectory information via a plurality of arranged visual elements on acomputer-enabled user interface, wherein visual elements representdirectory system entities and the arrangement of elements represents theinterrelationships of the corresponding directory system entities, themethod comprising: displaying a plurality of elements representing oneor more directory system entities using a first thread; receiving a userselection of a plurality of the displayed elements; using at least asecond thread, retrieving data associated with the selected displayedelements, while others of the displayed plurality of arranged visualelements remain responsive to initiate further data retrieval while thedata associated with the selected displayed elements are beingretrieved; and associating respective priorities with the retrievals ofthe selected displayed elements.
 28. The method of claim 27, whereinassociating respective priorities includes assigning a highest priorityto a last-selected one of the selected displayed elements.
 29. Themethod of claim 27, further comprising boosting the priority of one ofthe selected displayed elements.
 30. The method of claim 27, whereinboosting the priority is performed in response to an implicit request toboost the priority.
 31. The method of claim 27, wherein boosting thepriority is performed based on an order in which the displayed elementsare selected for retrieval.
 32. The method of claim 27, furthercomprising receiving a user re-selection of one of the selecteddisplayed elements, and boosting the priority associated with there-selected displayed element.
 33. The method of claim 27, whereinboosting the priority is performed in response to an explicit request toboost the priority.
 34. The method of claim 27, further comprisingreceiving an explicit user request to boost the priority of a selectedone of the selected displayed elements.
 35. The method of claim 34,wherein the explicit user request is received via a user interface. 36.The method of claim 27, wherein the displayed elements are arranged asnodes of a graphical hierarchy.
 37. The method of claim 36, wherein thegraphical hierarchy is a tree.
 38. A computer-readable medium havingthereon computer-executable instructions for executing a method forpresenting hierarchical categorized directory information via aplurality of arranged visual elements on a computer-enabled userinterface, wherein visual elements represent directory system entitiesand the arrangement of elements represents the interrelationships of thecorresponding directory system entities, the instructions comprisinginstructions for: displaying a plurality of elements representing one ormore directory system entities using a first thread; receiving a userselection of a plurality of the displayed elements; and using a secondthread, retrieving data associated with the selected displayed elementswhile others of the displayed plurality of arranged visual elementsremain responsive to initiate further data retrieval while the dataassociated with the initially selected displayed elements are beingretrieved; and associating respective priorities with the retrievals ofthe selected displayed elements.
 39. The computer-readable medium ofclaim 38, wherein the computer-executable instructions for associatingrespective priorities include computer-executable instructions forassigning a highest priority to a last-selected one of the selecteddisplayed elements.
 40. The computer-readable medium of claim 38,further comprising computer-executable instructions for boosting thepriority of one of the selected displayed elements.
 41. Thecomputer-readable medium of claim 38, wherein the computer-executableinstructions for boosting the priority are performed in response to animplicit request to boost the priority.
 42. The computer-readable mediumof claim 38, wherein the computer-executable instructions boost thepriority based on an order in which the displayed elements are selectedfor retrieval.
 43. The computer-readable medium of claim 38, furthercomprising computer-executable instructions for receiving a userre-selection of one of the selected displayed elements, and for boostingthe priority associated with the re-selected displayed element.
 44. Thecomputer-readable medium of claim 38, wherein the computer-executableinstructions boost the priority in response to an explicit request toboost the priority.
 45. The computer-readable medium of claim 38,further comprising computer-executable instructions for receiving anexplicit user request to boost the priority of a selected one of theselected displayed elements.
 46. The computer-readable medium of claim45, further comprising computer-executable instructions for receivingthe explicit user request via a user interface.